Add Fibonacci Heap implementation #11862
Closed
Conversation
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
- Implemented `FibonacciHeap` with core operations: `insert`, `extract_min`, `decrease_key`, and `delete`. - Added `Node` class for heap node structure. - Optimized for amortized time complexity with O(1) inserts and O(log n) extract min. - Included example usage and basic documentation.
Closing this pull request as invalid@mRcOol7, this pull request is being closed as none of the checkboxes have been marked. It is important that you go through the checklist and mark the ones relevant to this pull request. Please read the Contributing guidelines. If you're facing any problem on how to mark a checkbox, please read the following instructions:
NOTE: Only |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
This pull request introduces a complete implementation of the Fibonacci Heap data structure in Python, designed to optimize operations such as insertion and deletion, making it suitable for advanced algorithms.
Features:
Core Operations:
insert(key): Inserts a new node with the specified key.extract_min(): Removes and returns the node with the minimum key.decrease_key(node, new_key): Decreases the key of a specified node.delete(node): Deletes a specified node from the heap.Node Structure:
Nodeclass supports key, degree, parent, child, and circular doubly-linked list properties.Performance:
Documentation:
Usage:
This implementation can be utilized for efficient priority queue management and is particularly effective in algorithms such as Dijkstra's and Prim’s.